Hitting Times in Markov Chains with Restart and their Application to Network Centrality
نویسندگان
چکیده
منابع مشابه
Merge Times and Hitting Times of Time-inhomogeneous Markov Chains
The purpose of this thesis is to study the long term behavior of time-inhomogeneous Markov chains. We analyze under what conditions they converge, in what sense they converge and what the rate of convergence should be. A Markov chain is a random process with the memoryless property: the next state only depends on the current state, and not on the sequence of events that preceded it. Time-inhomo...
متن کاملMixing and hitting times for finite Markov chains
Let 0 < α < 1/2. We show that that the mixing time of a continuous-time Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of the state space with stationary measure ≥ α. Suitably modified results hold in discrete time and/or without the reversibility assumption. The key technical tool in the proof is the construction of random set A such tha...
متن کاملTight Inequalities among Set Hitting times in Markov Chains
Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time T (α) of a set of stationary measure at least α for α ∈ (0, 1). We obtain tight inequalities among the values of T (α) for different choices of α. One consequence is that T (α) ≤ T (1/2)/α for all α < 1/2. As a corollary we have that, if the chain is lazy in a certain sense as ...
متن کاملNetwork Essence: PageRank Completion and Centrality-Conforming Markov Chains
Jǐŕı Matoušek (1963-2015) had many breakthrough contributions in mathematics and algorithm design. His milestone results are not only profound but also elegant. By going beyond the original objects — such as Euclidean spaces or linear programs — Jirka found the essence of the challenging mathematical/algorithmic problems as well as beautiful solutions that were natural to him, but were surprisi...
متن کاملContinuum Limits of Markov Chains with Application to Wireless Network
We investigate the continuum limits of a class of Markov chains. The investigation of such limits is motivated by the desire to model networks with a very large number of nodes. We show that a sequence of such Markov chains indexed by N , the number of components in the system that they model, converges in a certain sense to its continuum limit, which is the solution of a partial differential e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2017
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-017-9600-5